package com.leetcode;

/**
 * 191. 位1的个数
 * 位运算优化
 */
public class Solution191_1 {
    public int hammingWeight(int n) {
        int count = 0;
        while (n != 0) {
            n &= n & n - 1;
            count++;
        }
        return count;
    }
}
